Multilevel Sparse Approximate Inverse Preconditioners for Adaptive Mesh Refinement∗
نویسندگان
چکیده
We present an efficient and effective preconditioning method for time-dependent simulations with dynamic, adaptive mesh refinement and implicit time integration. Adaptive mesh refinement greatly improves the efficiency of simulations where the solution develops steep gradients in small regions of the computational domain that change over time. Unfortunately, adaptive mesh refinement also introduces a number of problems for preconditioning in (parallel) iterative linear solvers, as the changes in the mesh lead to structural changes in the linear systems we must solve. Hence, we may need to compute a new preconditioner at every time-step. Since this would be expensive, we propose preconditioners that are cheap to adapt for dynamic changes to the mesh; more specifically, we propose preconditioners that require only localized changes to the preconditioner for localized changes in the mesh. Our preconditioners combine sparse approximate inverses and multilevel techniques. We demonstrate significant improvements in convergence rates of Krylov subspace methods and significant reductions of the overall runtime. Furthermore, we demonstrate experimentally level-independent convergence rates for various problems.
منابع مشابه
Multilevel preconditioners for simulations and optimization on dynamic, adaptive meshes
We present adaptive preconditioners for parallel, time-dependent simulations and nonlinear optimization problems with dynamic mesh adaptation. Adaptive meshing greatly reduces the computational cost of simulations and optimization. Unfortunately, it also carries a number of problems for preconditioning in iterative linear solvers, as changes in the mesh lead to structural changes in the linear ...
متن کاملILU and IUL factorizations obtained from forward and backward factored approximate inverse algorithms
In this paper, an efficient dropping criterion has been used to compute the IUL factorization obtained from Backward Factored APproximate INVerse (BFAPINV) and ILU factorization obtained from Forward Factored APproximate INVerse (FFAPINV) algorithms. We use different drop tolerance parameters to compute the preconditioners. To study the effect of such a dropping on the quality of the ILU ...
متن کاملA Class of Parallel Multilevel Sparse Approximate Inverse Preconditioners for Sparse Linear Systems
We investigate the use of the multistep successive preconditioning strategies (MSP) to construct a class of parallel multilevel sparse approximate inverse (SAI) preconditioners. We do not use independent set ordering, but a diagonal dominance based matrix permutation to build a multilevel structure. The purpose of introducing multilevel structure into SAI is to enhance the robustness of SAI for...
متن کاملMultigrid Treatment and Robustness Enhancement for Factored Sparse Approximate Inverse Preconditioning
We investigate the use of sparse approximate inverse techniques (SAI) in a grid based multilevel ILU preconditioner (GILUM) to design a robust parallelizable precon-ditioner for solving general sparse matrix. Taking the advantages of grid based mul-tilevel methods, the resulting preconditioner outperforms sparse approximate inverse in robustness and eeciency. Conversely, taking the advantages o...
متن کاملApproximate Inverse Preconditioners for Some Large Dense Random Electrostatic Interaction Matrices
A sparse mesh-neighbour based approximate inverse preconditioner is proposed for a type of dense matrices whose entries come from the evaluation of a slowly decaying free space Green’s function at randomly placed points in a unit cell. By approximating distant potential fields originating at closely spaced sources in a certain way, the preconditioner is given properties similar to, or better th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003